Relay Node Scheduling Model Based on Improved Discrete Markov Chain

This paper focuses on relay node scheduling method which is based on an improved discrete Markov chain. It presents a single relay node’s existing state, analyzes its access behavior, and summarizes various linear system design, according to our present balanced equations and form state transition probability, nodes are scheduled in relay network, the improved discrete time Markov chain is used to reduce destination noise, improve channel’s SNRs performance. The simulation shows that the Markov chainbased relay distribution scheduling model is better than the tradition similar relay network methods, and the result is consistent with the theoretical analysis.